Computing directed Steiner path covers

Abstract In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a graph $$G=(V,E)$$ G = ( V , E ) and set $$T \subseteq V$$ T ⊆ of so-called terminal vertices, is to find minimum number vertex-disjoint simple paths, which contain all vertices non-terminal (Steiner vertices). The primary minimization criteria paths. We show how compute in linear time path cover for This leads computation an optimal co-graphs, if it exists. Since generalizes Hamiltonian problem, our results imply first algorithm also give binary integer programs (directed) problem. These can be used minimize change-over times pick-and-place machines by companies electronic industry.